Minimum proper interval graphs
نویسندگان
چکیده
منابع مشابه
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
For graphs G and H , a mapping f : V (G)→V (H) is a homomorphism of G to H if uv ∈ E(G) implies f(u)f(v) ∈ E(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of the homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed graph H , we have the minimum cost homomorphism problem, written as MinHOM(H). The problem is to decide, for an input graph G with ...
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملComputing Minimum Geodetic Sets of Proper Interval Graphs
We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is NP-hard on chordal graphs and on bipartite weakly chordal graphs. Only an upper bound on the geodetic number of proper interval graphs has been known prior to
متن کاملClosed graphs are proper interval graphs
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00007-j